<?xml version="1.0" encoding="ISO-8859-1"?>
<metadatalist>
	<metadata ReferenceType="Conference Proceedings">
		<site>sibgrapi.sid.inpe.br 802</site>
		<holdercode>{ibi 8JMKD3MGPEW34M/46T9EHH}</holdercode>
		<identifier>83LX3pFwXQZW44Lb/d9sky</identifier>
		<repository>dpi.inpe.br/ambro/1998/05.14.11.04</repository>
		<lastupdate>1998:06.16.03.00.00 sid.inpe.br/banon/2001/03.30.15.38 administrator</lastupdate>
		<metadatarepository>sid.inpe.br/banon/2001/03.30.15.56.35</metadatarepository>
		<metadatalastupdate>2022:06.14.00.16.55 sid.inpe.br/banon/2001/03.30.15.38 administrator {D 1997}</metadatalastupdate>
		<citationkey>FabrisSilvForr:1997:EfFiAl</citationkey>
		<title>An efficient filling algorithm for non-simple closed curves using the point containment paradigm</title>
		<year>1997</year>
		<numberoffiles>1</numberoffiles>
		<size>114 KiB</size>
		<author>Fabris, Antonio Elias,</author>
		<author>Silva, Luciano,</author>
		<author>Forrest, A. Robin,</author>
		<editor>Figueiredo, Luiz Henrique de,</editor>
		<editor>Netto, Marcio Lobo,</editor>
		<conferencename>Brazilian Symposium on Computer Graphics and Image Processing, 10 (SIBGRAPI)</conferencename>
		<conferencelocation>Campos de Jordão, SP, Brazil</conferencelocation>
		<date>Oct. 1997</date>
		<publisher>IEEE Computer Society</publisher>
		<publisheraddress>Los Alamitos</publisheraddress>
		<pages>2-9</pages>
		<booktitle>Proceedings</booktitle>
		<tertiarytype>Full Paper</tertiarytype>
		<organization>SBC - Sociedade Brasileira de Computação; USP - Universidade de São Paulo</organization>
		<transferableflag>1</transferableflag>
		<versiontype>finaldraft</versiontype>
		<abstract>The Point Containment predicate which specifies if a point is part of a mathematically defined shape or not is one of the most basic notions in raster graphics. This paper presents a technique to counteract the main disadvantage of Point Containment algorithms: their quadratic time complexity with increasing resolution. The implementented algorithm handles complex geometries such as self-intersecting closed curves.</abstract>
		<language>en</language>
		<targetfile>art17.pdf</targetfile>
		<usergroup>administrator</usergroup>
		<visibility>shown</visibility>
		<nexthigherunit>8JMKD3MGPEW34M/46RL7SS</nexthigherunit>
		<nexthigherunit>8JMKD3MGPEW34M/4742MCS</nexthigherunit>
		<citingitemlist>sid.inpe.br/sibgrapi/2022/05.08.23.46 6</citingitemlist>
		<citingitemlist>sid.inpe.br/banon/2001/03.30.15.38.24 1</citingitemlist>
		<hostcollection>sid.inpe.br/banon/2001/03.30.15.38</hostcollection>
		<notes>The conference was held in Campos de Jordão, SP, Brazil, from October 13 to 16.</notes>
		<lasthostcollection>sid.inpe.br/banon/2001/03.30.15.38</lasthostcollection>
		<url>http://sibgrapi.sid.inpe.br/rep-/dpi.inpe.br/ambro/1998/05.14.11.04</url>
	</metadata>
</metadatalist>